Principal submatrices .VII. Further results concerning matrices with equal principal minors
نویسندگان
چکیده
منابع مشابه
Principal Submatrices VII : Further Results Concerning Matrices With Equal Principal Minors *
This paper characte rizes real symmetri c matri ces A s uch that all t X t princ ipal minors a re equal and a ll t X t nonprinc ipal minors a re of fixed sign, for two consecutive values of t less than rank A. It a lso cha rac te rizes matrices A (over an arbitrary fi eld ) in which a ll t X t principal minors are equal and all nonprin cipal t X t minors a re e qua l, for one fixed value of t l...
متن کاملGenerating and Detecting Matrices with Positive Principal Minors
A brief but concise review of methods to generate P-matrices (i.e., matrices having positive principal minors) is provided and motivated by open problems on P-matrices and the desire to develop and test efficient methods for the detection of P-matrices. Also discussed are operations that leave the class of P-matrices invariant. Some new results and extensions of results regarding P-matrices are...
متن کاملPrincipal minors and rhombus tilings
The algebraic relations between the principal minors of an n× n matrix are somewhat mysterious, see e.g. [LS09]. We show, however, that by adding in certain almost principal minors, the relations are generated by a single relation, the so-called hexahedron relation, which is a composition of six cluster mutations. We give in particular a Laurent-polynomial parameterization of the space of n× n ...
متن کاملPrincipal minors, Part II: The principal minor assignment problem
The inverse problem of finding a matrix with prescribed principal minors is considered. A condition that implies a constructive algorithm for solving this problem will always succeed is presented. The algorithm is based on reconstructing matrices from their principal submatrices and Schur complements in a recursive manner. Consequences regarding the overdeterminancy of this inverse problem are ...
متن کاملPrincipal minors, Part I: A method for computing all the principal minors of a matrix
An order O(2n) algorithm for computing all the principal minors of an arbitrary n× n complex matrix is motivated and presented, offering an improvement by a factor of n3 over direct computation. The algorithm uses recursive Schur complementation and submatrix extraction, storing the answer in a binary order. An implementation of the algorithm in MATLAB is also given and practical considerations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences
سال: 1968
ISSN: 0098-8979
DOI: 10.6028/jres.072b.024